On the Stochastic and Topological Structure of Markov Chains
نویسندگان
چکیده
The classification theory for shifts of finite type (topological Markov chains) in the strictest sense, that is to say, up to topological conjugacy, was initiated by Williams ([17]). Additions to this theory are represented by [1], [4], [6], [7], [11], [12] and [14]. Williams's work can be viewed either as topological or as a combined topological and measure-theoretic theory, where invariant measures are restricted to those of 'maximal' type. In a subsequent paper ([14]), Williams and the first-named author above developed a partial generalisation; a classification of all finite state stationary Markov chains up to block-isomorphism (i.e. topological and measure-theoretic equivalence). The complete invariant constructed was two parallel series of strongshift equivalences; one expressing the topological character and the other the stochastic character of the problem. Associated with this extremely complicated invariant are the topological and stochastic zeta functions. A defect in this theory is the unfortunate dislocation of invariants into topological and stochastic aspects. This defect is not merely aesthetic; it prevented the authors of [14] from formulating an appropriate notion of shift equivalence and an allied zeta function. Although it is not known whether shift equivalence implies strong shift equivalence (the converse is true), shift equivalence is a relationship which is much more manageable and in the topological case its decidability, for certain cases, has been proved ([5]). In this paper we introduce the notion of shift equivalence for stochastic matrices and a corresponding zeta function which subsumes both the topological and stochastic zeta functions. (Our construction could be deduced from Ruelle's work [15]. We should also like to point out that a more complicated version of the same zeta function was discovered by Roger Butler. A somewhat different zeta function was introduced by Martin in [8] for general ergodic theory. Readers may wish to compare Martin's zeta function with ours and to note the comments at the end of [8].) The basic new concepts used in this paper are adaptations of the so-called /̂ -function of [16], the one-parameterisation of Markov measures and the idea of restricting matrices to those whose entries are non-negative integral combinations of exponential functions (cf. [13]). With these notions and restrictions we are able to extend the results of [17], [14] and [11] and to establish the chain of implications shown on the next page. Since the techniques we require have already been elucidated elsewhere, we hope that our brief indications will suffice to convince the reader of the validity of our results. To avoid what seems to us unnecessary repetition we provide references to the results whose generalisations appear here and specify the additional ingredients required to provide complete proofs. We take this opportunity to record our gratitude to Roger Butler and Wolfgang Krieger for useful discussions related to the contents of this paper.
منابع مشابه
Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملENTROPY FOR DTMC SIS EPIDEMIC MODEL
In this paper at rst, a history of mathematical models is given.Next, some basic information about random variables, stochastic processesand Markov chains is introduced. As follows, the entropy for a discrete timeMarkov process is mentioned. After that, the entropy for SIS stochastic modelsis computed, and it is proved that an epidemic will be disappeared after a longtime.
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملA Model For The Residence Time Distribution and Holdup Measurement in a Two Impinging Streams Cyclone Reactor/Contactor in Solid-Liquid Systems
In this paper a two impinging streams cyclone contacting system suitable for handling of solid-liquid systems has been studied. Certain pertinent parameters such as: solid holdup, mean residence time and Residence Time Distribution (RTD) of solid particles have been investigated. A stochastic model based on Markov chains processes has been applied which describe the behavior of solid partic...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1982